1878E - Iva Pav - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int dp[200020][20];
void solve()
{
	int n;
	cin>>n;
	// int a[n+10];
	for(int i=1;i<=n;i++)
	{
		for(int j=0;j<=19;j++)dp[i][j]=0;
	}
	for(int i=1;i<=n;i++)cin>>dp[i][0];
	for(int i=n;i>=1;i--)
	{
		for(int j=1;j<=(int)log2(n-i+1);j++)
		{
			dp[i][j]=(dp[i][j-1]&dp[i+(1<<(j-1))][j-1]);
		}
	}
	int q;
	cin>>q;
	while(q--)
	{
		int l,k;
		cin>>l>>k;
		int r=n;
		int z=l;
		int an=-1;
		while(l<=r)
		{
			int mid=l+r>>1;
			int kk=z;
			int ans=dp[z][0];
			while(kk<=mid)
			{
				ans=(ans&dp[kk][(int)log2(mid-kk+1)]);
				kk+=(1<<(int)log2(mid-kk+1));
			}
			if(ans>=k)an=mid,l=mid+1;
			else r=mid-1;
		}
		cout<<an<<'\n';
	}
	cout<<'\n';
	// cout<<dp[1][2]<<endl;
}
int main() {
	int t;
	cin>>t;
	while(t--)solve();
	return 0;	
}